Major Assessment 1 Preparation

How to prepare for your first major assessment on Sept 28th?
1. What are the contents going to be covered in the assessment?

1.1 Program constructs

• sequence
• selection
• iteration/loop

1.2 Functions

• functions: how to define a funcion and call a user-defined function
• recursion: 2 conditions for a function
  • Fractional, Fibbonacci, Haoni, Binary Search

1.3 Data types:

• int, float
• collection: (string, tuple and list)
• Mutable and immutable

1.4 Algorithms:

• Search algorithms-- Linear search and binary search
• Merge algorithm and its 5 variations

1.5 The Turtle graphics and Event handling

• Turtle graphics for visualization
• Event handling for user interaction

1.6 State Machines

• traffic lights
• accumulators
• language accepetors

2. Materials for you to prepare for the assessment

• Pseudocode and flowchart for representing your algorithm: Please study carefuly the two documents to see how to represent your algorithms in pseudocode and flowchart.
• Tracetable and pseudocode exam question examples: Please study the two questions inside for efficient dry-run of your code and construct tracetables.
• Specimen papers with mark schemes: Please study the following questions to get yourself well-prepared:
  • HL Paper 1 Question 8
  • HL Paper 1 Question 11 a,b
  • SL Paper 1 Question 7
  • SL Paper 1 Question 10

3. Self-check
Can you work out all the exercises in our open book chapter 1 - 14?
Can you write the algorithm in both pseudocode and flowchart for your solution for each question?
Can you contruct a tracetable and dry-run the algorithm by yourself?
Can you convert an iterative algorithm to a recurssive algorithm if possible and vice-versa?